Integer Summing Algorithms on Reconfigurable Meshes

Integer Problems on Reconfigurable Meshes, with Applications*

Problems with solutions based upon integer computations are collectively referred to as integer problems. Such problems occur routinely in pattern recognition, image processing, graph theory, and query processing. The purpose of this paper is to present constant time algorithms for computing the prefix sums of an integer sequence, and for solving the packing problem on reconfigurable meshes. Th...

Optimal Algorithms on Reconfigurable Meshes

Constant Time Dynamic Programming on Directed Reconfigurable Networks

ÐSeveral dynamic programming algorithms are considered which can be efficiently implemented using parallel networks with reconfigurable buses. The bit model of general reconfigurable meshes with directed links, common write, and unit-time delay for broadcasting is assumed. Given two sequences of length m and n, respectively, their longest common subsequence can be found in constant time by an O...

Simulation Between Enhanced Meshes and the Multiple Associative Computing (MASC) Model

MASC (for Multiple Associative Computing) is a practical, highly scalable joint control parallel, data parallel model that naturally supports massive parallelism and a wide range of applications. In this paper, we propose efficient algorithms for the MASC model with a 2-D mesh to simulate enhanced meshes, e.g., meshes with multiple broadcasting (MMB), and basic reconfigurable meshes (BRM). The ...

An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes

It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size p n pn. Our main contribution is to provide the first breakthrough: we propose an almost optimal algorithm running in O((log logn)2) time on a reconfigurable mesh of size p n pn. With slight modifications this algorithm c...